A new Algorithm for the Computation of Logarithmic `-Class Groups of Number Fields
نویسندگان
چکیده
We present an algorithm for the computation of logarithmic `-class groups of number fields. Our principal motivation is the effective determination of the `-rank of the wild kernel in the K-theory of number fields.
منابع مشابه
A New Algorithm for the Computation of Logarithmic l-Class Groups of Number Fields
We present an algorithm for the computation of logarithmic `-class groups of number fields. Our principal motivation is the effective determination of the `-rank of the wild kernel in the K-theory of number fields.
متن کاملA New Algorithm for the Deinterleaving of Radar Pulses
This paper presents a new algorithm for the deinterleaving of radar signals, based on the direction of arrival (DOA), carrier frequency (RF), and time of arrival (TOA). The algorithm is applied to classic (constant), jitter, staggered, and dwell switch pulse repetition interval (PRI) signals. This algorithm consists of two stages. In the first stage, a Kohonen neural network clusters the receiv...
متن کاملOn Bivariate Generalized Exponential-Power Series Class of Distributions
In this paper, we introduce a new class of bivariate distributions by compounding the bivariate generalized exponential and power-series distributions. This new class contains the bivariate generalized exponential-Poisson, bivariate generalized exponential-logarithmic, bivariate generalized exponential-binomial and bivariate generalized exponential-negative binomial distributions as specia...
متن کاملA New Class of Zero-Inflated Logarithmic Series Distribution
Through this paper we suggest an alternative form of the modified zero-inflated logarithmic series distribution of Kumar and Riyaz (Statistica, 2013) and study some of its important aspects. The method of maximum likelihood is employed for estimating the parameters of the distribution and certain test procedures are considered for testing the significance of the additional parameter of the model. ...
متن کاملNew Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کامل